The Adaptive $s$-Step Conjugate Gradient Method
نویسندگان
چکیده
منابع مشابه
The Adaptive s-step Conjugate Gradient Method
On modern large-scale parallel computers, the performance of Krylov subspace iterative methods is limited by global synchronization. This has inspired the development of s-step (or communication-avoiding) Krylov subspace method variants, in which iterations are computed in blocks of s. This reformulation can reduce the number of global synchronizations per iteration by a factor of O(s), and has...
متن کاملAdaptive spectral estimation by the conjugate gradient method
This paper proposes an alternative technique for adaptive spectral estimation. The new technique applies the method of conjugate gradient, which is used for iteratively finding the generalized eigenvector corresponding to the minimum generalized eigenvalue of a semidefinite Hermitian matrix, to the adaptive spectral analysis problem. Computer simulations have been performed to compare the new m...
متن کاملAnalysis of the finite precision s-step biconjugate gradient method
We analyze the s-step biconjugate gradient algorithm in finite precision arithmetic and derive a bound for the residual norm in terms of a minimum polynomial of a perturbed matrix multiplied by an amplification factor. Our bound enables comparison of s-step and classical biconjugate gradient in terms of amplification factors. Our results show that for s-step biconjugate gradient, the amplificat...
متن کاملAdaptive Beam forming of Smart Antenna using Conjugate Gradient Method
This Paper focused on adaptive conjugate gradient method (CGM) algorithm and the same is compared with one of the fastest adaptive algorithm named recursive least squares (RLS) algorithm. This algorithms has improved the computation complexity and better convergence. MATLAB simulation showed that conjugate gradient algorithm has better output signal resolution.
متن کاملAn K - Step Preconditioned Conjugate Gradient Hethod
Tbis paper describes a preconditioned conjugate gradient method tbat can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systema of linear equations. The implementation on the CYBER 203/205 and on tbe Finite Element Machine is discuased and result a obtained using the method on these machines are siven.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2018
ISSN: 0895-4798,1095-7162
DOI: 10.1137/16m1107942